public class Solution {
    public static void main(String[] args) {
       int[] nums = {-2,1,-3,4,-1,2,1,-5,4};
       Solution solution = new Solution();
        System.out.println(solution.maxSubArray(nums));
    }
    //最大子数组和
    public int maxSubArray(int[] nums) {
        int n = nums.length;
        //i位置时最大子数组和
        int[] dp = new int[n];
        dp[0] = nums[0];
        int max = dp[0];
        for(int i = 1; i < n; i++) {
            dp[i] = Math.max(nums[i],dp[i-1] + nums[i]);
            max = Math.max(max,dp[i]);
        }
        return max;
    }
}
